About maximal cliques in a certain class of circular-arc graphs
نویسندگان
چکیده
In this paper we address the problem of finding all maximal cliques in a subclass of circular-arc graphs. We consider only circular-arc graphs that are generated with an arc model where no three arcs cover the whole circle. We prove that the number of maximal cliques is bounded by the number of vertices and that for each maximal clique it exists a point in the circle which is covered by all arcs corresponding to vertices of the given clique.
منابع مشابه
Performance of a greedy algorithm for edge covering by cliques in interval graphs
In this paper a greedy algorithm to detect conflict cliques in interval graphs and circular-arc graphs is analysed. In a graph, a stable set requires that at most one vertex is chosen for each edge. It is equivalent to requiring that at most one vertex for each maximal clique is chosen. We show that this algorithm finds all maximal cliques for interval graphs, i.e. it can compute the convex hul...
متن کاملInterval Routing Schemes for Circular-Arc Graphs
Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a routing function that implies exclusively sh...
متن کاملSelf-clique Helly circular-arc graphs
A clique in a graph is a complete subgraph maximal under inclusion. The clique graph of a graph is the intersection graph of its cliques. A graph is self-clique when it is isomorphic to its clique graph. A circular-arc graph is the intersection graph of a family of arcs of a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. In th...
متن کاملCharacterization and recognition of Helly circular-arc clique-perfect graphs
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. A graph G is clique-perfect if the sizes of a minimum clique-transversal and a maximum clique-independent set are equal for every induced subgraph of G. The list of minimal forbidden induced subgraphs for the class of clique-per...
متن کاملPartial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. A graph G is clique-perfect if the sizes of a minimum clique-transversal and a maximum clique-independent set are equal for every induced subgraph ofG. The list of minimal forbidden induced subgraphs for the class of clique-perf...
متن کامل